Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier6qtX3pFwXQZG2LgkFdY/UNhNr
Repositorysid.inpe.br/sibgrapi@80/2008/07.18.15.09
Last Update2008:07.18.15.09.32 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi@80/2008/07.18.15.09.34
Metadata Last Update2022:06.14.00.13.46 (UTC) administrator
DOI10.1109/SIBGRAPI.2008.24
Citation KeyAryaFonsMoun:2008:TrApRa
TitleTradeoffs in approximate range searching made simpler
FormatPrinted, On-line.
Year2008
Access Date2024, Apr. 28
Number of Files1
Size207 KiB
2. Context
Author1 Arya, Sunil
2 Fonseca, Guilherme D. da
3 Mount, David M.
Affiliation1 The Hong Kong University of Science and Technology
2 University of Maryland
3 University of Maryland
EditorJung, Cláudio Rosito
Walter, Marcelo
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 21 (SIBGRAPI)
Conference LocationCampo Grande, MS, Brazil
Date12-15 Oct. 2008
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2008-07-18 15:09:34 :: fonseca@cos.ufrj.br -> administrator ::
2009-08-13 20:38:55 :: administrator -> fonseca@cos.ufrj.br ::
2010-08-28 20:03:22 :: fonseca@cos.ufrj.br -> administrator ::
2022-06-14 00:13:46 :: administrator -> :: 2008
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsrange searching
geometric approximation
geometric data structures
computational geometry
AbstractRange searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in R^d into a data structure, so that it is possible to determine the subset of points lying within a given query range. In approximate range searching, a parameter eps > 0 is given, and for a given query range R the points lying within distance eps diam(R) of the range's boundary may be counted or not. In this paper we present three results related to the issue of tradeoffs in approximate range searching. First, we introduce the range sketching problem. Next, we present a space-time tradeoff for smooth convex ranges, which generalize spherical ranges. Finally, we show how to modify the previous data structure to obtain a space-time tradeoff for simplex ranges. In contrast to existing results, which are based on relatively complex data structures, all three of our results are based on simple, practical data structures.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2008 > Tradeoffs in approximate...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Tradeoffs in approximate...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/6qtX3pFwXQZG2LgkFdY/UNhNr
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZG2LgkFdY/UNhNr
Languageen
Target Filetradeoffs-final.pdf
User Groupfonseca@cos.ufrj.br
administrator
Visibilityshown
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPEW34M/46SG4TH
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.14.04.55 4
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close